Theorem Proving for Functional Programmers
نویسندگان
چکیده
منابع مشابه
Theorem proving for functional programmers Sparkle: a functional theorem prover
Sparkle is a new theorem prover written and specialized in the functional programming language Clean. It is in the first place intended to be used by programmers on small parts of Clean-programs, combining theorem proving and programming into one process. It should of course also be usable by logicians interested in proving properties of larger programs. This paper presents an example proof abo...
متن کاملSparkle: a functional theorem prover
Sparkle is a new theorem prover written and specialized in the functional programming language Clean. It is in the first place intended to be used by programmers on small parts of Clean-programs, combining theorem proving and programming into one process. It should of course also be usable by logicians interested in proving properties of larger programs. This paper presents an example proof abo...
متن کاملStructural Induction Principles for Functional Programmers
User defined recursive types are a fundamental feature of modern functional programming languages like Haskell, Clean, and the ML family of languages. Properties of programs defined by recursion on the structure of recursive types are generally proved by structural induction on the type. It is well known in the theorem proving community how to generate structural induction principles from data ...
متن کاملConstruction of measures of noncompactness of $C^k(Omega)$ and $C^k_0$ and their application to functional integral-differential equations
In this paper, first, we investigate the construction of compact sets of $ C^k$ and $ C_0^k$ by proving ``$C^k, C_0^k-version$" of Arzel`{a}-Ascoli theorem, and then introduce new measures of noncompactness on these spaces. Finally, as an application, we study the existence of entire solutions for a class of the functional integral-differential equations by using Darbo's fixe...
متن کاملIntroducing Functional Programmers to Interactive Theorem Proving and Program Verification
We report on the design and preliminary evaluation of a short introductory course on interactive theorem proving and program verification using the Coq proof assistant, targeted at students with background in functional programming and software engineering. The course builds on concepts familiar from functional programming to develop understanding of logic and mechanized proving by means of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001